Optimal Synthesis in the Reeds and Shepp Problem with Onesided Variation of Velocity
نویسندگان
چکیده
We consider a time-optimal problem for the Reeds and Shepp model describing a moving point on a plane, with a onesided variation of the speed and a free final direction of velocity. Using Pontryagin Maximum Principle, we obtain all possible types of extremals and, analyzing them and discarding nonoptimal ones, construct the optimal synthesis.
منابع مشابه
Shortest Paths for the Reeds - Shepp Car : a Worked out Example of the Use of Geometric Techniques in Nonlinear Optimal Control
We illustrate the use of the techniques of modern geometric optimal control theory by studying the shortest paths for a model of a car that can move forwards and backwards. This problem was discussed in recent work by Reeds and Shepp who showed, by special methods, (a) that shortest path motion could always be achieved by means of trajectories of a special kind, namely, concatenations of at mos...
متن کاملReport SYCON–91-10 SHORTEST PATHS FOR THE REEDS-SHEPP CAR: A WORKED OUT EXAMPLE OF THE USE OF GEOMETRIC TECHNIQUES IN NONLINEAR OPTIMAL CONTROL
We illustrate the use of the techniques of modern geometric optimal control theory by studying the shortest paths for a model of a car that can move forwards and backwards. This problem was discussed in recent work by Reeds and Shepp who showed, by special methods, (a) that shortest path motion could always be achieved by means of trajectories of a special kind, namely, concatenations of at mos...
متن کاملExtension of Reeds & Shepp Paths to a Robot with Front and Rear Wheel Steer
This paper presents an algorithm for extending RS paths for a robot with both front and rear wheel steer. We call such robots as FR steer. The occurrence of such paths is due to the additional maneuver possible in such a robot which we call parallel steer, in addition to the ones already present in a vehicle with only front wheel steering. Hence we extend the optimal path set Λ, containing only...
متن کاملDirect Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration
This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...
متن کاملObstacle Distances and Visibility for Car-Like Robots Moving Forward
This paper deals with distance computation between a car-like robot moving only forward and polygonal obstacles. We propose eecient geometric algorithms to compute the shortest paths to obstacles. We then derive the \visibility" domain in the presence of obstacles , i.e. the set of positions reachable from a starting connguration, by a collision-free shortest path unaffected by the presence of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Optimization Theory and Applications
دوره 158 شماره
صفحات -
تاریخ انتشار 2013